Asynchronous Analogs of Iterative Methods and Their Efficiency for Parallel Computers
نویسندگان
چکیده
This paper gives the comparison of some iterative methods (Jacobi method, Gauss–Seidel method and the Successive over-relaxation method) for solving systems of linear equations with their asynchronous implementations. Experiments show the effectiveness of asynchronous iterative methods for solving linear algebra problems on parallel multiprocessor systems.
منابع مشابه
A Practical Method to Implement Asynchronous Iterative Algorithms on MPI and a Case Study for Asynchronous Self-Organizing Maps
In this paper, an effective implementation scheme for asynchronous parallel iterative algorithms on messagepassing systems using MPI non-blocking communication model is proposed. The main idea of the method is to use a MPI_IPROBE function to check for the existence of pending messages without receiving them, thereby allowing us to write programs that interleave local computation with the proces...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 09-12 Fast Iterative Solution of Large Sparse Linear Systems on Geographically Separated Clusters
Parallel asynchronous iterative algorithms exhibit features that are extremely well–suited for Grid computing, such as lack of synchronisation points. Unfortunately, they also suffer from slow convergence rates. In this paper we propose using asynchronous methods as a coarse–grain preconditioner in a flexible iterative method, where the preconditioner is allowed to change in each iteration step...
متن کاملIterative Methods for the Solution of Integral Viscoelastic Equations on Parallel Computers
The objective of our work is to explore the potential of parallel computers in numerical simulation of viscoelastic flows. Viscoelastic flow simulations often result in ill-conditioned algebraic systems and, therefore, direct solution methods have been in vogue. But the main disadvantage of direct methods is their excessive storage requirements for large matrices, especially for three-dimension...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملFast iterative solution of large sparse linear systems on geographically separated clusters
Parallel asynchronous iterative algorithms exhibit features that are extremely well-suited for Grid computing, such as lack of synchronization points. Unfortunately, they also suffer from slow convergence rates. In this paper we propose using asynchronous methods as a coarse-grained preconditioner in a flexible iterative method, where the preconditioner is allowed to change in each iteration st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013